Computing Irreducible Representations of Supersolvable Groups
نویسندگان
چکیده
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
منابع مشابه
Computing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...
متن کاملElementary Proofs of Some Results on Representations of P-groups
A result of Roquette 3] states that if D is an absolutely irreducible representation of a p-group G over the eld of complex numbers, then D can be realized in K((g) j g 2 G), where is the character of D and K = Q or K = Q(i) according to whether p 6 = 2 or p = 2. Based on Baum and Clausen's 1] algorithm for computing the irreducible representations of supersolvable groups, we give an elementary...
متن کاملGenerating fast Fourier transforms of solvable groups
This paper presents a new algorithm for constructing a complete list of pairwise inequivalent ordinary irreducible representations of a finite solvable group G. The input of the algorithm is a pc-presentation corresponding to a composition series refining a chief series of G. Modifying the Baum-Clausen-Algorithm for supersolvable groups and combining this with an idea of Plesken for constructin...
متن کاملRational permutation modules for finite groups
By the Artin Induction theorem,C(G) is a finite abelian group with exponent dividing the order of G. Some work on this sequence has already been done. In [14] and [16], Ritter and Segal proved that C(G) = 0 for G a finite p–group. Serre [17, p. 104] remarked that C(G) / = 0 for G = Z/3 × Q8 (the direct product of a cyclic group of order 3 and a quaternion group of order 8). Berz [2] gave a nice...
متن کاملAn Efficient Computer Program for the Symbolic Construction of Irreducible Representations of Supersolvable Groups
Baum and Clausen have presented in [1] an algorithm, refered to as BC-Algorithm, for the construction of a complete list of pairwise inequivalent ordinary irreducible representations for a given finite supersolvable group G. This algorithm is almost optimal in the sense that the running time is proportional to the length of the output up to some logarithmic factors. In this paper we describe an...
متن کامل